High-multiplicity election problems
نویسندگان
چکیده
منابع مشابه
High Multiplicity Scheduling Problems
These four years proved to be a very interesting and enjoyable period of my life. I was introduced to the international research community and visited many scientific events in different parts of the world. First of all, I want to heartily thank my supervisors, Antoon Kolen, Yves Crama, and Joris van de Klundert, for haven given me the opportunity to join the scientific world and academic commu...
متن کاملA Framework for the Complexity of High-Multiplicity Scheduling Problems
The purpose of this note is to propose a complexity framework for the analysis of high multiplicity scheduling problems. Part of this framework relies on earlier work aiming at the definition of outputsensitive complexity measures for the analysis of algorithms which produce “large” outputs. However, different classes emerge according as we look at schedules as sets of starting times, or as rel...
متن کاملLeader Election in Rings with Bounded Multiplicity (Short Paper)
We study leader election in unidirectional rings of homonym processes that have no a priori knowledge on the number of processes. We show that message-terminating leader election is impossible for any class of rings Kk with bounded multiplicity k ≥ 2. However, we show that process-terminating leader election is possible in the subclass U∗ ∩ Kk, where U ∗ is the class of rings which contain a pr...
متن کاملHigh Multiplicity Strip Packing
An instance of the two-dimensional strip packing problem is specified by n rectangular items, each having a width, 0 < wn ≤ 1, and height, 0 < hn ≤ 1. The objective is to place these items into a strip of width 1, without rotations, such that they are nonoverlapping and the total height of the resulting packing is minimized. In this thesis, we consider the version of the twodimensional strip pa...
متن کاملSolving election manipulation using integer partitioning problems
An interesting problem of multi-agent systems is that of voting, in which the preferences of autonomous agents are to be combined. Applications of voting include modeling social structures, search engine ranking, and choosing a leader among computational agents. In the setting of voting, it is very important that each agent presents truthful information about his or her preferences, and not man...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Autonomous Agents and Multi-Agent Systems
سال: 2019
ISSN: 1387-2532,1573-7454
DOI: 10.1007/s10458-019-09410-4